Gabow, Harold: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

Path-based depth-first search for strong and biconnected components

Harold N. Gabow

Journal:

Information Processing Letters

Year:

2000

Language:

english

File:

PDF, 110 KB

english, 2000

2

Unique Maximum Matching Algorithms

Harold N Gabow, Haim Kaplan, Robert E Tarjan

Journal:

Journal of Algorithms

Year:

2001

Language:

english

File:

PDF, 158 KB

english, 2001

3

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Gabow, Harold N.

Journal:

Journal of the ACM

Year:

1976

Language:

english

File:

PDF, 828 KB

english, 1976

4

Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Driscoll, James R., Gabow, Harold N., Shrairman, Ruth, Tarjan, Robert E.

Journal:

Communications of the ACM

Year:

1988

Language:

english

File:

PDF, 6.69 MB

english, 1988

5

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Harold N. Gabow, Zvi Galil, Thomas Spencer, Robert E. Tarjan

Journal:

Year:

1986

Language:

english

File:

PDF, 939 KB

english, 1986

6

An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs

Galil, Zvi, Micali, Silvio, Gabow, Harold

Journal:

SIAM Journal on Computing

Year:

1986

Language:

english

File:

PDF, 1.34 MB

english, 1986

7

Faster Scaling Algorithms for Network Problems

Gabow, Harold N., Tarjan, Robert E.

Journal:

SIAM Journal on Computing

Year:

1989

Language:

english

File:

PDF, 3.36 MB

english, 1989

8

[ACM Press the sixteenth annual ACM symposium - Not Known (1984..-..)] Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84 - Scaling and related techniques for geometry problems

Gabow, Harold N., Bentley, Jon Louis, Tarjan, Robert E.

Year:

1984

Language:

english

File:

PDF, 833 KB

english, 1984

9

The Weighted Matching Approach to Maximum Cardinality Matching

Gabow, Harold N., Păun, Gheorghe, Rozenberg, Grzegorz, Salomaa, Arto

Journal:

Fundamenta Informaticae

Year:

2017

Language:

english

File:

PDF, 317 KB

english, 2017

10

Finding All Spanning Trees of Directed and Undirected Graphs

Gabow, Harold N., Myers, Eugene W.

Journal:

SIAM Journal on Computing

Year:

1978

Language:

english

File:

PDF, 876 KB

english, 1978

11

Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems

Harold N. Gabow, Ying Xu

Journal:

Journal of Computer and System Sciences

Year:

1996

Language:

english

File:

PDF, 754 KB

english, 1996

12

Decomposing symmetric exchanges in matroid bases

Journal:

Mathematical Programming

Year:

1976

Language:

english

File:

PDF, 253 KB

english, 1976

13

Finding a long directed cycle

Gabow, Harold N., Nie, Shuxin

Journal:

ACM Transactions on Algorithms

Year:

2008

Language:

english

File:

PDF, 262 KB

english, 2008

14

Efficient algorithms for a family of matroid intersection problems

Harold N Gabow, Robert E Tarjan

Journal:

Journal of Algorithms

Year:

1984

Language:

english

File:

PDF, 3.01 MB

english, 1984

15

A linear-time algorithm for a special case of disjoint set union

Harold N. Gabow, Robert Endre Tarjan

Journal:

Journal of Computer and System Sciences

Year:

1985

Language:

english

File:

PDF, 931 KB

english, 1985

16

[ACM Press the fifteenth annual ACM symposium - Not Known (1983..-..)] Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 - A linear-time algorithm for a special case of disjoint set union

Gabow, Harold N., Tarjan, Robert Endre

Year:

1983

Language:

english

File:

PDF, 633 KB

english, 1983

17

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs

Galil, Zvi, Galil, Zvi, Galil, Zvi, Galil, Zvi, Micali, Silvio, Micali, Silvio, Micali, Silvio, Micali, Silvio, Gabow, Harold, Gabow, Harold, Gabow, Harold, Gabow, Harold

Year:

1982

Language:

english

File:

PDF, 841 KB

english, 1982

18

E1688

R. A. Jacobson and Harold Gabow

Journal:

American Mathematical Monthly

Year:

1965

Language:

english

File:

PDF, 281 KB

english, 1965

19

Algorithms for Edge Coloring Bipartite Graphs and Multigraphs

Gabow, Harold N., Kariv, Oded

Journal:

SIAM Journal on Computing

Year:

1982

Language:

english

File:

PDF, 1.48 MB

english, 1982

20

Using expander graphs to find vertex connectivity

Gabow, Harold N.

Journal:

Journal of the ACM

Year:

2006

Language:

english

File:

PDF, 553 KB

english, 2006

21

A Counting Approach to Lower Bounds for Selection Problems

Fussenegger, Frank, Gabow, Harold N.

Journal:

Journal of the ACM

Year:

1979

Language:

english

File:

PDF, 625 KB

english, 1979

22

Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines

Gabow, Harold N.

Journal:

SIAM Journal on Computing

Year:

1988

Language:

english

File:

PDF, 2.20 MB

english, 1988

23

On the L∞-norm of extreme points for crossing supermodular directed network LPs

Harold N. Gabow

Journal:

Mathematical Programming

Year:

2007

Language:

english

File:

PDF, 450 KB

english, 2007

24

[IEEE 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Houston, TX, USA (1976.10.25-1976.10.27)] 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Using computer trees to derive lower bounds for selection problems

Fussenegger, Frank, Gabow, Harold N.

Year:

1976

Language:

english

File:

PDF, 531 KB

english, 1976

25

[IEEE 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Tucson, AZ, USA (1983.11.7-1983.11.9)] 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Scaling algorithms for network problems

Gabow, Harold N.

Year:

1983

Language:

english

File:

PDF, 1.47 MB

english, 1983

26

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings

Cygan, Marek, Gabow, Harold N., Sankowski, Piotr

Year:

2012

Language:

english

File:

PDF, 284 KB

english, 2012

27

Editor's foreword

Harold N. Gabow

Journal:

Year:

1994

Language:

english

File:

PDF, 156 KB

english, 1994

28

Iterated Rounding Algorithms for the Smallest k -Edge Connected Spanning Subgraph

Gabow, Harold N., Gallagher, Suzanne R.

Journal:

SIAM Journal on Computing

Year:

2012

Language:

english

File:

PDF, 897 KB

english, 2012

29

Finding Paths and Cycles of Superpolylogarithmic Length

Gabow, Harold N.

Journal:

SIAM Journal on Computing

Year:

2007

Language:

english

File:

PDF, 288 KB

english, 2007

30

[ACM Press the twentieth annual ACM symposium - Chicago, Illinois, United States (1988.05.02-1988.05.04)] Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 - Forests, frames, and games: algorithms for matroid sums and applications

Gabow, Harold, Westermann, Herbert

Year:

1988

Language:

english

File:

PDF, 1.28 MB

english, 1988

31

A combinatoric interpretation of dual variables for weighted matching and -factors

Gabow, Harold N.

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 534 KB

english, 2012

32

A Model for Minimizing Active Processor Time

Jessica Chang, Harold N. Gabow, Samir Khuller

Journal:

Year:

2014

Language:

english

File:

PDF, 1.08 MB

english, 2014

33

The limits of input-queued switch performance with future packet arrival information

Timothy X. Brown, Harold N. Gabow

Journal:

Computer Networks

Year:

2003

Language:

english

File:

PDF, 301 KB

english, 2003

34

Forests, frames, and games: Algorithms for matroid sums and applications

Harold N. Gabow, Herbert H. Westermann

Journal:

Year:

1992

Language:

english

File:

PDF, 2.04 MB

english, 1992

35

Two Algorithms for Generating Weighted Spanning Trees in Order

Gabow, Harold N.

Journal:

SIAM Journal on Computing

Year:

1977

Language:

english

File:

PDF, 1.28 MB

english, 1977

36

Editor's Foreword

Harold N. Gabow

Journal:

Journal of Computer and System Sciences

Year:

1993

File:

PDF, 28 KB

1993

37

An efficient approximation algorithm for the survivable network design problem

Harold N. Gabow, Michel X. Goemans, David P. Williamson

Journal:

Mathematical Programming

Year:

1998

Language:

english

File:

PDF, 1.91 MB

english, 1998

38

An Algorithm for Strongly Connected Component Analysis innlognSymbolic Steps

Roderick Bloem, Harold N. Gabow, Fabio Somenzi

Journal:

Formal Methods in System Design

Year:

2006

Language:

english

File:

PDF, 344 KB

english, 2006

39

Some improved bounds on the number of 1-factors of n-connected graphs

Harold N. Gabow

Journal:

Information Processing Letters

Year:

1976

Language:

english

File:

PDF, 474 KB

english, 1976

40

Editor's foreword

Gabow, Harold N.

Journal:

ACM Transactions on Algorithms

Year:

2005

Language:

english

File:

PDF, 21 KB

english, 2005

41

Foreword to special issue on SODA 2007

Journal:

ACM Transactions on Algorithms

Year:

2009

File:

PDF, 24 KB

2009

42

[ACM Press the tenth annual ACM symposium - San Diego, California, United States (1978.05.01-1978.05.03)] Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 - Algorithms for edge coloring bipartite graphs

Gabow, Harold N., Kariv, Oded

Year:

1978

Language:

english

File:

PDF, 511 KB

english, 1978

43

Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Harold N. Gabow, K. S. Manu

Journal:

Mathematical Programming

Year:

1998

Language:

english

File:

PDF, 1.95 MB

english, 1998

44

[ACM Press the twentieth annual ACM symposium - Chicago, Illinois, United States (1988.05.02-1988.05.04)] Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 - Almost-optimum speed-ups of algorithms for bipartite matching and related problems

Gabow, Harold, Tarjan, Robert

Year:

1988

Language:

english

File:

PDF, 1.35 MB

english, 1988

45

Approximating the smallest k-edge connected spanning subgraph by LP-rounding

Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson

Journal:

Year:

2009

Language:

english

File:

PDF, 196 KB

english, 2009

46

Bipartition constrained edge-splitting in directed graphs

Harold N. Gabow, Tibor Jordán

Journal:

Discrete Applied Mathematics

Year:

2001

Language:

english

File:

PDF, 147 KB

english, 2001

47

Algorithms for two bottleneck optimization problems

Harold N Gabow, Robert E Tarjan

Journal:

Journal of Algorithms

Year:

1988

Language:

english

File:

PDF, 435 KB

english, 1988

48

Parallel tetrahedral mesh adaptation with dynamic load balancing

Leonid Oliker, Rupak Biswas, Harold N Gabow

Journal:

Parallel Computing

Year:

2000

Language:

english

File:

PDF, 481 KB

english, 2000

49

An Improved Analysis for Approximating the Smallest k -Edge Connected Spanning Subgraph of a Multigraph

Gabow, Harold N.

Journal:

SIAM Journal on Discrete Mathematics

Year:

2005

Language:

english

File:

PDF, 221 KB

english, 2005

50

Efficient implementation of graph algorithms using contraction

Gabow, Harold N., Galil, Zvi, Spencer, Thomas H.

Journal:

Journal of the ACM

Year:

1989

Language:

english

File:

PDF, 2.97 MB

english, 1989

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски